Sphere packing bounds in the Graßmann and Stiefel manifolds

نویسنده

  • Oliver Henkel
چکیده

With methods from Riemannian geometry bounds for the minimal distance of packings in the Graßmann and Stiefel manifolds will be derived and analysed, revealing implications for certain aspects of coding theory. Though motivated from coding theory on the Graßmann and Stiefel manifolds, the method can be generalised to arbitrary Riemannian homogeneous spaces as well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple point of self-transverse immesions of certain manifolds

In this paper we will determine the multiple point manifolds of certain self-transverse immersions in Euclidean spaces. Following the triple points, these immersions have a double point self-intersection set which is the image of an immersion of a smooth 5-dimensional manifold, cobordant to Dold manifold $V^5$ or a boundary. We will show there is an immersion of $S^7times P^2$ in $mathbb{R}^{1...

متن کامل

Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels

Many of the classic problem of coding theory are highly symmetric, which makes it easy to derive spherepacking upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and sphere-covering bounds to arbitrary error models. These generalizations become especially important when the sizes of the error spheres are nonuniform. The best poss...

متن کامل

New Upper Bounds on Sphere Packings I

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

متن کامل

New Upper Bounds on Sphere Packings I

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

متن کامل

1 O ct 2 00 1 NEW UPPER BOUNDS ON SPHERE PACKINGS

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003